Restricting Voronoi diagrams to meshes using corner validation
نویسندگان
چکیده
Restricted Voronoi diagrams are a fundamental geometric structure used in many applications such as surface reconstruction from point sets or optimal transport. Given a set of sites V = {vk}k=1 ⊂ R d and a mesh X with vertices in Rd connected by triangles, the restricted Voronoi diagram partitions X by computing for each site the portion of X for which the site is the nearest. The restricted Voronoi diagram is the intersection between the regular Voronoi diagram and the mesh. Depending on the site distribution or the ambient space dimension computing the regular Voronoi diagram may not be feasible using classical algorithms. In this paper, we extend Lévy and Bonneel’s approach [LB12] based on nearest neighbor queries. We show that their method is limited when the sites are not located on X. We propose a new algorithm for computing restricted Voronoi which reduces the number of sites considered for each triangle of the mesh and scales smoothly when the sites are far from the surface.
منابع مشابه
Polyline-sourced Geodesic Voronoi Diagrams on Triangle Meshes
This paper studies the Voronoi diagrams on 2-manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point-source based GVDs, since a typical bisector contains line segments, hyperbolic segments and paraboli...
متن کاملLloyd relaxation using analytical Voronoi diagram in the L ∞ norm and its application to quad optimization
An incremental Delaunay triangulation algorithm to generate Voronoi diagrams within the L∞ norm is presented. The main qualities are the preservation of the simplicity of the classical L2 version and its its intrinsic robustness It is then coupled to the well known Lloyd algorithm for computing Centroidal Voronoi Tesselations of point sets. This algorithm is then used to generate well shaped qu...
متن کاملApproximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct uniform tessellations, and therefore leads to uniform coarsening of polygonal meshes, when the output triangulation has many fewer elements than the input mesh. The mesh topology is also simplified by the clustering algo...
متن کاملVoronoi Region-Based Spatiotemporal GIS Databases
The use of Voronoi diagrams in GIS-oriented spatiotemporal databases is considered. The Voronoi algorithms generate appropriate meshes for data interpolation. We illustrate the data representation in this database generated from a point-based spatiotemporal relation in the National Agricultural Statistics Service (NASS) database.
متن کاملVoronoi Natural Neighbors Interpolation
Implementing point cloud to grid conversion for digital elevation maps (DEM) presents one with many options for interpolation and we intend to explore algorithms for interpolation during the conversion process with a specific focus on Voronoi natural neighbor interpolation. By partitioning the environment into Voronoi cells and using the information from neighboring cells and their respective g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 36 شماره
صفحات -
تاریخ انتشار 2017